Parameterized Complexity and Subexponential Time

نویسندگان

  • Jacobo Torán
  • Jörg Flum
  • Martin Grohe
چکیده

Parameterized Complexity in its origins was considered by many researchers to be an exotic research eld, orthogonal to the standard way of classifying problems in complexity theory. In the last years however many surprising connections between Parameterized Complexity and classical areas in complexity theory have been established. Jörg Flum and Martin Grohe survey in this column some of these interesting connections including links to the areas of bounded nondeterminism, subexponential complexity or syntactic complexity classes.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Subexponential Time and Fixed-Parameter Tractability: Exploiting the Miniaturization Mapping

Recently it has been shown that the miniaturization mapping M faithfully translates subexponential parameterized complexity into (unbounded) parameterized complexity. We determine the preimages under M of various (classes of) problems. For many parameterized problems whose underlying classical problem is in NP we show that the preimages coincide with natural reparameterizations which take into ...

متن کامل

Subexponential Parameterized Algorithms Collapse the W - hierarchy ∗ ( Extended

It is shown that for essentially all MAX SNP-hard optimization problems finding exact solutions in subexponential time is not possible unless W [1] = FPT . In particular, we show that O(2p(n)) parameterized algorithms do not exist for Vertex Cover, Max Cut, Max c-Sat, and a number of problems on bounded degree graphs such as Dominating Set and Independent Set, unless W [1] = FPT . Our results a...

متن کامل

Subexponential parameterized algorithm for minimum fill-in

The Minimum Fill-in problem is to decide if a graph can be triangulated by adding at most k edges. Kaplan, Shamir, and Tarjan [FOCS 1994] have shown that the problem is solvable in time O(2O(k) + knm) on graphs with n vertices and m edges and thus is fixed parameter tractable. Here, we give the first subexponential parameterized algorithm solving Minimum Fillin in time O(2O( √ k log k) + knm). ...

متن کامل

The Exponential Time Hypothesis and the Parameterized Clique Problem

In parameterized complexity there are three natural definitions of fixed-parameter tractability called strongly uniform, weakly uniform and nonuniform fpt. Similarly, there are three notions of subexponential time, yielding three flavours of the exponential time hierarchy (ETH) stating that 3Sat is not solvable in subexponential time. It is known that ETH implies that p-Clique is not fixed-para...

متن کامل

Subexponential Algorithms for Partial Cover Problems

Partial Cover problems are optimization versions of fundamental and well studied problems like Vertex Cover and Dominating Set. Here one is interested in covering (or dominating) the maximum number of edges (or vertices) using a given number (k) of vertices, rather than covering all edges (or vertices). In general graphs, these problems are hard for parameterized complexity classes when paramet...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004